import java.util.*;

/**
 * @author LKQ
 * @date 2022/5/22 16:46
 * @description 对偶性质
 */
public class Solution2 {
    public static void main(String[] args) {

    }
    public long countVowels(String word) {
        long ans = 0;
        int n = word.length();
        for (int i = 0; i < n; i++) {
            if (isYuan(word.charAt(i))) {
                // 包含的子串，左端点 [0..i] 右端点 [i..n-1]
                ans += (long) (i + 1) * (n - i);
            }
        }
        return ans;
    }
    public boolean isYuan(char c) {
        return c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u';
    }
}
